package anbow.math;

import java.util.Scanner;

public class FindOne {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int count=0;//与操作的次数=n中1的个数
		while(n>0) {
			n = n&(n-1);
			count++;
		}
		System.out.println(count);
	}

}
